Theorems of Sylvester and Schur
نویسنده
چکیده
An old theorem of Sylvester states that a product of k consecutive positive integers each exceeding k is divisible by a prime greater than k. We shall give a proof of this theorem and apply it to prove a result of Schur on the irreducibility of certain polynomials.
منابع مشابه
Theoretical results on the global GMRES method for solving generalized Sylvester matrix equations
The global generalized minimum residual (Gl-GMRES) method is examined for solving the generalized Sylvester matrix equation [sumlimits_{i = 1}^q {A_i } XB_i = C.] Some new theoretical results are elaborated for the proposed method by employing the Schur complement. These results can be exploited to establish new convergence properties of the Gl-GMRES method for solving genera...
متن کاملA Schur Method for Solving Projected Continuous-Time Sylvester Equations
In this paper, we propose a direct method based on the real Schur factorization for solving the projected Sylvester equation with relatively small size. The algebraic formula of the solution of the projected continuous-time Sylvester equation is presented. The computational cost of the direct method is estimated. Numerical experiments show that this direct method has high accuracy. Keywords—Pro...
متن کاملContributions to Parallel Algorithms for Sylvester-type Matrix Equations and Periodic Eigenvalue Reordering in Cyclic Matrix Products
This Licentiate Thesis contains contributions in two different subfields of Computing Science: parallel ScaLAPACK-style algorithms for Sylvester-type matrix equations and periodic eigenvalue reordering in a cyclic product of matrices. Sylvester-type matrix equations, like the continuous-time Sylvester equation AX −XB = C, where A of size m×m, B of size n×n and C of size m×n are general matrices...
متن کاملA Structured Rank - Revealing Method for Sylvester Matrix 1 )
We propose a displacement structure based rank-revealing algorithm for Sylvester matrix, then apply it to compute approximate greatest common division of two univariate polynomials with floating-point coefficients. This structured rank-revealing method is based on a stabilized version of the generalized Schur algorithm [8], and is a fast rank-revealing method in the sense that, all computations...
متن کاملDouble Sylvester sums for subresultants and multi-Schur functions
J. J. Sylvester has announced formulas expressing the subresultants (or the successive polynomial remainders for the Euclidean division) of two polynomials, in terms of some double sums over the roots of the two polynomials. We prove Sylvester formulas using the techniques of multivariate polynomials involving multi-Schur functions and divided differences. Introduction and statement of the main...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007